package q387_firstUniqChar;

public class Solution {
    /*
    直接两次循环即可
     */
    public int firstUniqChar(String s) {
        int[] chars = new int[26];
        for (int i = 0; i < s.length(); i++) {
            ++chars[s.charAt(i) - 'a'];
        }
        for (int i = 0; i < s.length(); i++) {
            if (chars[s.charAt(i) - 'a'] == 1) return i;
        }
        return -1;
    }
}
